github.com/klauspost/compress/zstd.fastBase.maxMatchOff (field)
161 uses
github.com/klauspost/compress/zstd (current package)
dict.go#L233: enc := encoder(&bestFastEncoder{fastBase: fastBase{maxMatchOff: int32(maxMatchLen), bufferReset: math.MaxInt32 - int32(maxMatchLen*2), lowMem: false}})
enc_base.go#L18: maxMatchOff int32
enc_base.go#L43: if size > 0 && size < int64(e.maxMatchOff) {
enc_base.go#L49: return e.maxMatchOff
enc_base.go#L66: if cap(e.hist) < int(e.maxMatchOff+maxCompressedBlockSize) {
enc_base.go#L67: panic(fmt.Errorf("unexpected buffer cap %d, want at least %d with window %d", cap(e.hist), e.maxMatchOff+maxCompressedBlockSize, e.maxMatchOff))
enc_base.go#L70: offset := int32(len(e.hist)) - e.maxMatchOff
enc_base.go#L71: copy(e.hist[0:e.maxMatchOff], e.hist[offset:])
enc_base.go#L73: e.hist = e.hist[:e.maxMatchOff]
enc_base.go#L86: l := e.maxMatchOff
enc_base.go#L87: if (e.lowMem && e.maxMatchOff > maxCompressedBlockSize) || e.maxMatchOff <= maxCompressedBlockSize {
enc_base.go#L90: l += e.maxMatchOff
enc_base.go#L120: if s-t > e.maxMatchOff {
enc_base.go#L121: err := fmt.Sprintf("s (%d) - t (%d) > maxMatchOff (%d)", s, t, e.maxMatchOff)
enc_base.go#L158: e.cur += e.maxMatchOff + int32(len(e.hist))
enc_best.go#L91: e.cur = e.maxMatchOff
enc_best.go#L95: minOff := e.cur + int32(len(e.hist)) - e.maxMatchOff
enc_best.go#L103: v = v - e.cur + e.maxMatchOff
enc_best.go#L107: v2 = v2 - e.cur + e.maxMatchOff
enc_best.go#L122: v = v - e.cur + e.maxMatchOff
enc_best.go#L126: v2 = v2 - e.cur + e.maxMatchOff
enc_best.go#L134: e.cur = e.maxMatchOff
enc_best.go#L211: if delta >= e.maxMatchOff || delta <= 0 || load3232(src, offset) != first {
enc_best.go#L236: tMin := max(s-e.maxMatchOff, 0)
enc_best.go#L245: panic(fmt.Sprintf("offset: %d - s:%d - rep: %d - cur :%d - max: %d", offset, s, rep, e.cur, e.maxMatchOff))
enc_best.go#L353: if best.offset < s-e.maxMatchOff {
enc_best.go#L354: panic(fmt.Sprintf("best.offset < s-e.maxMatchOff: %d < %d", best.offset, s-e.maxMatchOff))
enc_best.go#L490: end := int32(len(d.content)) - 8 + e.maxMatchOff
enc_best.go#L491: for i := e.maxMatchOff; i < end; i += 4 {
enc_best.go#L494: cv := load6432(d.content, i-e.maxMatchOff)
enc_best.go#L529: offset: e.maxMatchOff,
enc_best.go#L533: end := int32(len(d.content)) - 8 + e.maxMatchOff
enc_best.go#L535: for i := e.maxMatchOff + 1; i < end; i++ {
enc_best.go#L550: e.cur = e.maxMatchOff
enc_better.go#L69: e.cur = e.maxMatchOff
enc_better.go#L73: minOff := e.cur + int32(len(e.hist)) - e.maxMatchOff
enc_better.go#L79: v = v - e.cur + e.maxMatchOff
enc_better.go#L90: v = v - e.cur + e.maxMatchOff
enc_better.go#L94: v2 = v2 - e.cur + e.maxMatchOff
enc_better.go#L102: e.cur = e.maxMatchOff
enc_better.go#L193: tMin := max(s-e.maxMatchOff, 0)
enc_better.go#L252: tMin := max(s-e.maxMatchOff, 0)
enc_better.go#L298: if s-coffsetL < e.maxMatchOff && cv == load6432(src, coffsetL) {
enc_better.go#L305: if debugAsserts && s-t > e.maxMatchOff {
enc_better.go#L312: if s-coffsetLP < e.maxMatchOff && cv == load6432(src, coffsetLP) {
enc_better.go#L322: if debugAsserts && s-t > e.maxMatchOff {
enc_better.go#L333: if s-coffsetLP < e.maxMatchOff && cv == load6432(src, coffsetLP) {
enc_better.go#L340: if debugAsserts && s-t > e.maxMatchOff {
enc_better.go#L352: if s-coffsetS < e.maxMatchOff && uint32(cv) == candidateS.val {
enc_better.go#L365: if s-coffsetL < e.maxMatchOff && cv == load6432(src, coffsetL) {
enc_better.go#L381: if s-coffsetL < e.maxMatchOff && cv == load6432(src, coffsetL) {
enc_better.go#L398: if debugAsserts && s-t > e.maxMatchOff {
enc_better.go#L431: if coffsetL >= 0 && coffsetL < s2 && s2-coffsetL < e.maxMatchOff && cv == load3232(src, coffsetL) {
enc_better.go#L447: if coffsetL >= 0 && coffsetL < s2 && s2-coffsetL < e.maxMatchOff && cv == load3232(src, coffsetL) {
enc_better.go#L477: tMin := max(s-e.maxMatchOff, 0)
enc_better.go#L596: e.cur = e.maxMatchOff
enc_better.go#L601: minOff := e.cur + int32(len(e.hist)) - e.maxMatchOff
enc_better.go#L607: v = v - e.cur + e.maxMatchOff
enc_better.go#L618: v = v - e.cur + e.maxMatchOff
enc_better.go#L622: v2 = v2 - e.cur + e.maxMatchOff
enc_better.go#L631: e.cur = e.maxMatchOff
enc_better.go#L713: tMin := max(s-e.maxMatchOff, 0)
enc_better.go#L774: tMin := max(s-e.maxMatchOff, 0)
enc_better.go#L823: if s-coffsetL < e.maxMatchOff && cv == load6432(src, coffsetL) {
enc_better.go#L830: if debugAsserts && s-t > e.maxMatchOff {
enc_better.go#L837: if s-coffsetLP < e.maxMatchOff && cv == load6432(src, coffsetLP) {
enc_better.go#L847: if debugAsserts && s-t > e.maxMatchOff {
enc_better.go#L858: if s-coffsetLP < e.maxMatchOff && cv == load6432(src, coffsetLP) {
enc_better.go#L865: if debugAsserts && s-t > e.maxMatchOff {
enc_better.go#L877: if s-coffsetS < e.maxMatchOff && uint32(cv) == candidateS.val {
enc_better.go#L891: if s-coffsetL < e.maxMatchOff && cv == load6432(src, coffsetL) {
enc_better.go#L907: if s-coffsetL < e.maxMatchOff && cv == load6432(src, coffsetL) {
enc_better.go#L924: if debugAsserts && s-t > e.maxMatchOff {
enc_better.go#L949: if coffsetL >= 0 && coffsetL < s && s-coffsetL < e.maxMatchOff && cv == load3232(src, coffsetL) {
enc_better.go#L964: if coffsetL >= 0 && coffsetL < s && s-coffsetL < e.maxMatchOff && cv == load3232(src, coffsetL) {
enc_better.go#L993: tMin := max(s-e.maxMatchOff, 0)
enc_better.go#L1113: end := int32(len(d.content)) - 8 + e.maxMatchOff
enc_better.go#L1114: for i := e.maxMatchOff; i < end; i += 4 {
enc_better.go#L1117: cv := load6432(d.content, i-e.maxMatchOff)
enc_better.go#L1153: offset: e.maxMatchOff,
enc_better.go#L1157: end := int32(len(d.content)) - 8 + e.maxMatchOff
enc_better.go#L1159: for i := e.maxMatchOff + 1; i < end; i++ {
enc_better.go#L1228: e.cur = e.maxMatchOff
enc_dfast.go#L51: e.cur = e.maxMatchOff
enc_dfast.go#L55: minOff := e.cur + int32(len(e.hist)) - e.maxMatchOff
enc_dfast.go#L61: v = v - e.cur + e.maxMatchOff
enc_dfast.go#L70: v = v - e.cur + e.maxMatchOff
enc_dfast.go#L74: e.cur = e.maxMatchOff
enc_dfast.go#L152: tMin := max(s-e.maxMatchOff, 0)
enc_dfast.go#L184: if coffsetL < e.maxMatchOff && uint32(cv) == candidateL.val {
enc_dfast.go#L192: if debugAsserts && s-t > e.maxMatchOff {
enc_dfast.go#L202: if coffsetS < e.maxMatchOff && uint32(cv) == candidateS.val {
enc_dfast.go#L213: if coffsetL < e.maxMatchOff && uint32(cv) == candidateL.val {
enc_dfast.go#L229: if debugAsserts && s-t > e.maxMatchOff {
enc_dfast.go#L266: tMin := max(s-e.maxMatchOff, 0)
enc_dfast.go#L388: e.cur = e.maxMatchOff
enc_dfast.go#L459: tMin := max(s-e.maxMatchOff, 0)
enc_dfast.go#L491: if coffsetL < e.maxMatchOff && uint32(cv) == candidateL.val {
enc_dfast.go#L499: if debugAsserts && s-t > e.maxMatchOff {
enc_dfast.go#L509: if coffsetS < e.maxMatchOff && uint32(cv) == candidateS.val {
enc_dfast.go#L520: if coffsetL < e.maxMatchOff && uint32(cv) == candidateL.val {
enc_dfast.go#L536: if debugAsserts && s-t > e.maxMatchOff {
enc_dfast.go#L570: tMin := max(s-e.maxMatchOff, 0)
enc_dfast.go#L696: e.cur = e.maxMatchOff
enc_dfast.go#L700: minOff := e.cur + int32(len(e.hist)) - e.maxMatchOff
enc_dfast.go#L706: v = v - e.cur + e.maxMatchOff
enc_dfast.go#L715: v = v - e.cur + e.maxMatchOff
enc_dfast.go#L720: e.cur = e.maxMatchOff
enc_dfast.go#L800: tMin := max(s-e.maxMatchOff, 0)
enc_dfast.go#L832: if coffsetL < e.maxMatchOff && uint32(cv) == candidateL.val {
enc_dfast.go#L840: if debugAsserts && s-t > e.maxMatchOff {
enc_dfast.go#L850: if coffsetS < e.maxMatchOff && uint32(cv) == candidateS.val {
enc_dfast.go#L862: if coffsetL < e.maxMatchOff && uint32(cv) == candidateL.val {
enc_dfast.go#L878: if debugAsserts && s-t > e.maxMatchOff {
enc_dfast.go#L915: tMin := max(s-e.maxMatchOff, 0)
enc_dfast.go#L1060: offset: e.maxMatchOff,
enc_dfast.go#L1062: end := int32(len(d.content)) - 8 + e.maxMatchOff
enc_dfast.go#L1063: for i := e.maxMatchOff + 1; i < end; i++ {
enc_dfast.go#L1064: cv = cv>>8 | (uint64(d.content[i-e.maxMatchOff+7]) << 56)
enc_dfast.go#L1074: e.cur = e.maxMatchOff
enc_fast.go#L51: e.cur = e.maxMatchOff
enc_fast.go#L55: minOff := e.cur + int32(len(e.hist)) - e.maxMatchOff
enc_fast.go#L61: v = v - e.cur + e.maxMatchOff
enc_fast.go#L65: e.cur = e.maxMatchOff
enc_fast.go#L146: sMin := max(s-e.maxMatchOff, 0)
enc_fast.go#L174: if coffset0 < e.maxMatchOff && uint32(cv) == candidate.val {
enc_fast.go#L180: if debugAsserts && s-t > e.maxMatchOff {
enc_fast.go#L186: if coffset1 < e.maxMatchOff && uint32(cv>>8) == candidate2.val {
enc_fast.go#L193: if debugAsserts && s-t > e.maxMatchOff {
enc_fast.go#L223: tMin := max(s-e.maxMatchOff, 0)
enc_fast.go#L310: e.cur = e.maxMatchOff
enc_fast.go#L384: sMin := max(s-e.maxMatchOff, 0)
enc_fast.go#L412: if coffset0 < e.maxMatchOff && uint32(cv) == candidate.val {
enc_fast.go#L418: if debugAsserts && s-t > e.maxMatchOff {
enc_fast.go#L422: panic(fmt.Sprintf("t (%d) < 0, candidate.offset: %d, e.cur: %d, coffset0: %d, e.maxMatchOff: %d", t, candidate.offset, e.cur, coffset0, e.maxMatchOff))
enc_fast.go#L427: if coffset1 < e.maxMatchOff && uint32(cv>>8) == candidate2.val {
enc_fast.go#L434: if debugAsserts && s-t > e.maxMatchOff {
enc_fast.go#L463: tMin := max(s-e.maxMatchOff, 0)
enc_fast.go#L548: e.cur = e.maxMatchOff
enc_fast.go#L552: minOff := e.cur + int32(len(e.hist)) - e.maxMatchOff
enc_fast.go#L558: v = v - e.cur + e.maxMatchOff
enc_fast.go#L562: e.cur = e.maxMatchOff
enc_fast.go#L646: sMin := max(s-e.maxMatchOff, 0)
enc_fast.go#L674: if coffset0 < e.maxMatchOff && uint32(cv) == candidate.val {
enc_fast.go#L680: if debugAsserts && s-t > e.maxMatchOff {
enc_fast.go#L686: if coffset1 < e.maxMatchOff && uint32(cv>>8) == candidate2.val {
enc_fast.go#L693: if debugAsserts && s-t > e.maxMatchOff {
enc_fast.go#L723: tMin := max(s-e.maxMatchOff, 0)
enc_fast.go#L815: end := e.maxMatchOff + int32(len(d.content)) - 8
enc_fast.go#L816: for i := e.maxMatchOff; i < end; i += 2 {
enc_fast.go#L819: cv := load6432(d.content, i-e.maxMatchOff)
enc_fast.go#L836: e.cur = e.maxMatchOff
encoder_options.go#L54: return &fastEncoderDict{fastEncoder: fastEncoder{fastBase: fastBase{maxMatchOff: int32(o.windowSize), bufferReset: math.MaxInt32 - int32(o.windowSize*2), lowMem: o.lowMem}}}
encoder_options.go#L56: return &fastEncoder{fastBase: fastBase{maxMatchOff: int32(o.windowSize), bufferReset: math.MaxInt32 - int32(o.windowSize*2), lowMem: o.lowMem}}
encoder_options.go#L60: return &doubleFastEncoderDict{fastEncoderDict: fastEncoderDict{fastEncoder: fastEncoder{fastBase: fastBase{maxMatchOff: int32(o.windowSize), bufferReset: math.MaxInt32 - int32(o.windowSize*2), lowMem: o.lowMem}}}}
encoder_options.go#L62: return &doubleFastEncoder{fastEncoder: fastEncoder{fastBase: fastBase{maxMatchOff: int32(o.windowSize), bufferReset: math.MaxInt32 - int32(o.windowSize*2), lowMem: o.lowMem}}}
encoder_options.go#L65: return &betterFastEncoderDict{betterFastEncoder: betterFastEncoder{fastBase: fastBase{maxMatchOff: int32(o.windowSize), bufferReset: math.MaxInt32 - int32(o.windowSize*2), lowMem: o.lowMem}}}
encoder_options.go#L67: return &betterFastEncoder{fastBase: fastBase{maxMatchOff: int32(o.windowSize), bufferReset: math.MaxInt32 - int32(o.windowSize*2), lowMem: o.lowMem}}
encoder_options.go#L69: return &bestFastEncoder{fastBase: fastBase{maxMatchOff: int32(o.windowSize), bufferReset: math.MaxInt32 - int32(o.windowSize*2), lowMem: o.lowMem}}
 |
The pages are generated with Golds v0.8.4. (GOOS=linux GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @zigo_101 (reachable from the left QR code) to get the latest news of Golds. |